Sampling online social networks by random walk with indirect jumps
نویسندگان
چکیده
منابع مشابه
Sampling Online Social Networks by Random Walk with Indirect Jumps
Random walk-based sampling methods are gaining popularity and importance in characterizing large networks. While powerful, they suffer from the slow mixing problem when the graph is loosely connected, which results in poor estimation accuracy. Random walk with jumps (RWwJ) can address the slow mixing problem but it is inapplicable if the graph does not support uniform vertex sampling (UNI). In ...
متن کاملWalk, Not Wait: Faster Sampling Over Online Social Networks
In this paper, we introduce a novel, general purpose, technique for faster sampling of nodes over an online social network. Specifically, unlike traditional random walks which wait for the convergence of sampling distribution to a predetermined target distribution a waiting process that incurs a high query cost we develop WALK-ESTIMATE, which starts with a much shorter random walk, and then pro...
متن کاملReal time enhanced random sampling of online social networks
Social graphs can be easily extracted from Online Social Networks (OSNs). However, as the size and evolution of this kind of networks increases over time, typical sampling methods used to evaluate large graph information cannot accurately extract network’s properties. Furthermore in an attempt to deal with ever increasing access and possible malicious incidents (e.g. Denial of Services), OSNs p...
متن کاملRandom walk with jumps in large-scale random geometric graphs
0140-3664/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.comcom.2010.01.026 q This work has been supported in part by the proje Architecture) (IST-27489), the PENED 2003 program Research and Technology (GSRT) co-financed by the and by National Sources (25%) and the NoE CONTENT * Corresponding author. Address: National and Kapo Department of Informatics and Telecommunications, I Tel.: +30...
متن کاملCounting Edges with Target Labels in Online Social Networks via Random Walk
Online social networks (OSNs) embed a rich set of information that could be used in a few fields. Extensive research has been done on estimating graph properties such as counts of wedges and triangles in OSNs. While these graph properties which are defined based on the structural information only are useful at a coarse level, they are not sufficient in applications where finegrained information...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Mining and Knowledge Discovery
سال: 2018
ISSN: 1384-5810,1573-756X
DOI: 10.1007/s10618-018-0587-5